Specialize SPPF nodes and optimize child node comparisons#50
Open
RodionovMaxim05 wants to merge 3 commits intoFormalLanguageConstrainedPathQuerying:mainfrom
Open
Specialize SPPF nodes and optimize child node comparisons#50RodionovMaxim05 wants to merge 3 commits intoFormalLanguageConstrainedPathQuerying:mainfrom
RodionovMaxim05 wants to merge 3 commits intoFormalLanguageConstrainedPathQuerying:mainfrom
Conversation
…reference to list to reduce memory consumption
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
hasChild can use
===(reference equality) instead ofequals, since SppfStorage deduplicates all nodes through createdSppfNodes - the same node always maps to the same object reference.Comparison results of CFL-based approximation methods for interleaved Dyck reachability using the optimized and original versions: https://drive.google.com/drive/folders/1B3elWZ52mO4g0gTj9mP1td56DraU_qmi?usp=sharing. There are graphs of time and memory (as well as the results themselves)